The directed Hausdorff distance between imprecise point sets
نویسندگان
چکیده
منابع مشابه
The Directed Hausdorff Distance between Imprecise Point Sets
We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an imprecise pointmaybe anywherewithin its disc. Due to the direction of the Hausdorff distance and whether its tight upper or lower bound is computed, there are se...
متن کاملThe directed Hausdorff distance between 1 imprecise point sets
We consider the directed Hausdorff distance between point sets in the 9 plane, where one or both point sets consist of imprecise points. An imprecise point is 10 modelled by a disc given by its centre and a radius. The actual position of an imprecise 11 point may be anywhere within its disc. Due to the direction of the Hausdorff Distance 12 and whether its tight upper or lower bound is computed...
متن کاملMinimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
Matching geometric objects with respect to their Hausdorff distance is a well investigated problem in Computational Geometry with various application areas. The variant investigated in this paper is motivated by the problem of determining a matching (in this context also called registration) for neurosurgical operations. The task is, given a sequence P of weighted point sets (anatomic landmarks...
متن کاملMatching Curves to Imprecise Point Sets using Fréchet Distance
Let P be a polygonal curve in R of length n, and S be a point-set of size k. The Curve/Point Set Matching problem consists of finding a polygonal curve Q on S such that the Fréchet distance from P is less than a given ε. We consider eight variations of the problem based on the distance metric used and the omittability or repeatability of the points. We provide closure to a recent series of comp...
متن کاملAn efficient approach to directly compute the exact Hausdorff distance for 3D point sets
Hausdorff distance measure is very important in CAD/CAE/CAM related applications. This manuscript presents an efficient framework and two complementary subalgorithms to directly compute the exact Hausdorff distance for general 3D point sets. The first algorithm of Nonoverlap Hausdorff Distance (NOHD) combines branch-and-bound with early breaking to cut down the Octree traversal time in case of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.01.039